The Realization and Analysis of Kruskal's Algorithm Based on Greedy Policy 基于贪婪策略的克鲁斯卡尔算法的实现与分析
In this short note, we show that maximum bandwidth paths can be constructed by a modified Kruskal's algorithm. We demonstrate that this approach is simpler, easier in implementation, more flexible, and faster than the previously proposed algorithms. 本文证明可以使用修改的Kruskal算法来构建最大带宽路径,并且演示了该算法比前面提出的算法更为简单、灵活、快速且易于实现。